Abstractions pour la vérification de propriétés de sécurité de protocoles cryptographiques. (Abstractions for verification of security properties of cryptographic protocols)
نویسنده
چکیده
ions pour la vérification de propriétés de sécurité de protocoles cryptographiques Soutenue le 19 septembre 2003 Composition du jury : – Michel Bidoit Directeur de thèse – Paul Gastin Président du jury – Jean Goubault-Larrecq Examinateur – Francis Klay Examinateur – Yassine Lakhnech Rapporteur – Jean-François Raskin Rapporteur
منابع مشابه
Constraints-based Verification of Parameterized Cryptographic Protocols
Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. Although many works have been dedicated to standard protocols like Needham-Schroder very few address the more challenging class of group protocols. We present a synchronous model for group protocols, that generalizes st...
متن کاملThéories de l'intrus pour la vérification des protocoles cryptographiques. (Intruder theories for the verification of cryptographic protocols)
Je remercie aussi les différentes personnes qui ont soutenu (et soutiennent encore !) la vie du campus de l'École, parfois au détriment de leur scolarité, en s'investissant dans les associations et les clubs animant les soirées et les weekends : (par ordre alphabétique, j'espère ne pas avoir oublié trop de monde ou du moins, de ne pas avoir oublié de personnes ran-m'ont permis d'apprécier les a...
متن کاملComputationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and probability. This approach captures a strong notion of security, guaranteed against all probabilistic polynomial-time attacks. The other approach relies on a symbolic model of protocol executions in which cryptographi...
متن کاملOn the Reachability Problem in Cryptographic Protocols
We study the veri cation of secrecy and authenticity properties for cryptographic protocols which rely on symmetric shared keys. The veri cation can be reduced to check whether a certain parallel program which models the protocol and the speci cation can reach an erroneous state while interacting with the environment. Assuming nite principals, we present a simple decision procedure for the reac...
متن کاملSatisfiability of General Intruder Constraints with and without a Set Constructor
Many decision problems on security protocols can be reduced to solving socalled intruder constraints in the Dolev Yao model. Most constraint solving procedures for cryptographic protocol security rely on two properties of constraint systems called knowledge monotonicity and variable-origination. In this work we relax these restrictions by giving an NP decision procedure for solving general intr...
متن کامل